An application of variable neighbourhood search to hospital call scheduling of infant formula promotion
نویسندگان
چکیده
In the infant formula industry, products must rely on the prescription or recommendation from healthcare physicians (HCPs). Therefore, it is the most important activity in sales promotion to call on the identified HCPs in the prospected hospitals by the territory promotional sales representatives (PSRs). The PSRs have to establish their monthly hospital call schedule according to several constraints. In this paper, we investigate the hospital call scheduling of PSRs, a real-world case provided by an international infant formula company operating in Taiwan. The objective is minimising the total travel time. First, we present a four-phase heuristic to quickly generate a feasible schedule. We then apply a variable neighbourhood search incorporated with memory and revolver schemes to improve the solution quality. Through extensive computational experiments, it is shown that the proposed solution approaches are quite effective in terms of solution quality and computation time. Journal of the Operational Research Society (2011) 62, 949–959. doi:10.1057/jors.2010.42 Published online 19 May 2010
منابع مشابه
A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملVariable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried out. In this paper, an investigation on implementing VNS for job shop scheduling problems is carried out tackling benchmark suites collected from OR library. The idea is to build the best local search and shake opera...
متن کاملRandomised Variable Neighbourhood Search for Multi Objective Optimisation
Various local search approaches have recently been applied to machine scheduling problems under multiple objectives. Their foremost consideration is the identification of the set of Pareto optimal alternatives. An important aspect of successfully solving these problems lies in the definition of an appropriate neighbourhood structure. Unclear in this context remains, how interdependencies within...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملAn innovative algorithm for planning and scheduling healthcare units with the aim of reducing the length of stay for patients (Case study: Cardiac SurgeryWard of Razavi Hospital of Mashhad)
One of the key applications of operational research in health systems management is to improve the mechanism of resource allocation and program planning in order to increase the system efficiency. This study seeks to offer an innovative method for the planning and scheduling of health service units with the aim of reducing the patients' Length of Stay (LOS) in the Cardiac Surgery Ward of Razavi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JORS
دوره 62 شماره
صفحات -
تاریخ انتشار 2011